Random Sampling of 3-colourings in Z *
نویسندگان
چکیده
We consider the problem of uniformly sampling proper 3-colourings of an m × n rectangular region of Z. We show that the single-site “Glauber-dynamics” Markov chain is rapidly mixing. Our result complements an earlier result of Luby, Randall and Sinclair, which demonstrates rapid mixing when there is a fixed boundary (whose colour cannot be changed). c © John Wiley & Sons, Inc.
منابع مشابه
Counting and Sampling H-Colourings
For counting problems in #P which are “essentially self-reducible”, it is known that sampling and approximate counting are equivalent. However, many problems of interest do not have such a structure and there is already some evidence that this equivalence does not hold for the whole of #P. An intriguing example is the class ofH-colouring problems, which have recently been the subject of much st...
متن کاملSampling colourings of the triangular lattice
We show that the Glauber dynamics on proper 9-colourings of the triangular lattice is rapidly mixing, which allows for efficient sampling. Consequently, there is a fully polynomial randomised approximation scheme (FPRAS) for counting proper 9-colourings of the triangular lattice. Proper colourings correspond to configurations in the zero-temperature anti-ferromagnetic Potts model. We show that ...
متن کاملRandom sampling of colourings of sparse random graphs with a constant number of colours
In this work we present a simple and efficient algorithm which, with high probability, provides an almost uniform sample from the set of proper k-colourings on an instance of sparse random graphs Gn,d/n, where k = k(d) is a sufficiently large constant. Our algorithm is not based on the Markov Chain Monte Carlo method (M.C.M.C.). Instead, we provide a novel proof of correctness of our Algorithm ...
متن کاملA Systematic Scan for 7-colourings of the Grid
We study the mixing time of a systematic scan Markov chain for sampling from the uniform distribution on proper 7-colourings of a finite rectangular sub-grid of the infinite square lattice, the grid. A systematic scan Markov chain cycles through finite-size subsets of vertices in a deterministic order and updates the colours assigned to the vertices of each subset. The systematic scan Markov ch...
متن کاملUpper bounds on the non-3-colourability threshold of random graphs
We present a full analysis of the expected number of ‘rigid’ 3-colourings of a sparse random graph. This shows that, if the average degree is at least 4.99, then as n→ ∞ the expected number of such colourings tends to 0 and so the probability that the graph is 3-colourable tends to 0. (This result is tight, in that with average degree 4.989 the expected number tends to ∞.) This bound appears in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006